Novel algorithms for shared segment protection
نویسندگان
چکیده
The major challenges in designing survivable schemes are how to allocate minimal amount of spare resources (e.g., bandwidth) using fast (e.g., polynomial-time) algorithms, and in case a failure occurs, to be able to quickly recover from it. All existing approaches invariably make tradeoffs. In this paper, we propose novel shared segment protection algorithms which make little or no compromise. We develop an elegant integer linear programming (ILP) model to determine an optimal set of segments to protect a given active path. Although the ILP approach is useful for a medium-size network, it is too time consuming for large networks. Accordingly, we also design a fast heuristic algorithm based on dynamic programming to obtain a near-optimal set of segments. Although the heuristic algorithm has a polynomial time complexity, it can achieve a bandwidth efficiency as high as some best-performing shared path protection schemes and at the same time, much faster recovery than these shared path protection schemes. The proposed scheme is also applicable to a wide range of networking technologies including Internet protocol and wavelength-division multiplexing networks under the generalized multiprotocol label switched framework.
منابع مشابه
Minimum Interference Routing Adding Shared Segment Protection in GMPLS-based Networks*
This paper presents a novel method to enhance minimum interference routing by adding shared segment protection in GMPLS-based networks. Minimum interference routing without maximum flow computation and shared backup schemes are combined to set up novel online restorable QoS routing algorithms. Proposed method also considers protection at the lower optical level by not overprotecting paths, whic...
متن کاملLinear Formulation for Segment Shared Protection
This paper proposes a novel linear formulation for the problem of segment shared protection, where the switching/merging nodes and the least-cost link-disjoint working and protection segments corresponding to each switching/merging node-pair are jointly determined for a connection request. A novel approach of arc-reversal graph transformation is introduced. We verify the ILP and compare it with...
متن کاملOPTIMALIZATION PHASE USING GRAPH MODELLING FOR RELIABLE BUILDING COMPLEXES
During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...
متن کاملSegment shared protection for survivable meshed WDM optical networks
In this paper, we investigate the protection design for survivable meshed WDM optical networks, and propose a novel heuristic algorithm, which is called segment shared protection (SSP), to completely protect the dual-link failures. For each connection request, first SSP computes a least-cost working path, second SSP divides the working path into several un-overlapped segment paths according to ...
متن کاملPragmatic Segment Protection Employing Distributed Multiple-ring Search in WDM Mesh Networks
This work proposes the segment fault protection mechanism called Non-Overlap Segment Protection (NOSP) and Overlap Segment Protection (OSP) using the method of multiple-ring search in Wavelength Division Multiplexing (WDM) mesh networks. Multiple-ring search operates in distributed control, and gathers network information through neighboring nodes. Hence, the proposed methods can be adopted in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Journal on Selected Areas in Communications
دوره 21 شماره
صفحات -
تاریخ انتشار 2003